Tree Containment With Soft Polytomies
نویسندگان
چکیده
منابع مشابه
Containment for Conditional Tree Patterns
A Conditional Tree Pattern (CTP) expands an XML tree pattern with labels attached to the descendant edges. These labels can be XML element names or Boolean CTP’s. The meaning of a descendant edge labelled by A and ending in a node labelled by B is a path of child steps ending in a B node such that all intermediate nodes are A nodes. In effect this expresses the until B, A holds construction fro...
متن کاملContainment for Tree Patterns with Attribute Value Comparisons
Tree patterns (TP) is a simple and widely used fragment of XPath. The problem of containment in TP has been extensively studied previously. It was shown that the containment problem ranges from PTime to PSpace depending on the available constructs. In this paper we study the complexity of the containment problem for tree patterns with attribute value comparisons. We show that the complexity ran...
متن کاملLinear-Time Tree Containment in Phylogenetic Networks
We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaflabeled network contains a subdivision of a given leaf-labeled tree. We develop a fast algorithm for the case that the input network is indeed a tree in which multiple leaves might share a label. By combining this algorithm with a generalization of a previously know...
متن کاملAlgorithms for Unrooted Gene Trees with Polytomies
Gene tree reconciliation is a method to reconcile gene trees that are confounded by complex histories of gene duplications with a provided species tree. The trees involved are required to be rooted and full binary. Reconciling gene trees allows not only to identify and study such histories for gene families, but is also the base for several higher level applications including the estimation of ...
متن کاملReconciling Gene Trees with Apparent Polytomies
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this problem handle only binary gene trees or interpret polytomies in the gene tree as true. While in practice polytomies occur frequently, they are typically not true. Most polytomies represent unresolved evolutionary relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2021
ISSN: ['1526-1719']
DOI: https://doi.org/10.7155/jgaa.00565